Energy-aware IP traffic engineering with shortest path routing
نویسندگان
چکیده
Internet energy consumption is rapidly becoming an issue due to the exponential traffic growth and the rapid expansion of communication infrastructures worldwide. We address the problem of energy-aware intra-domain traffic engineering in networks operated with a shortest path routing protocol. We consider the problem of switching off (putting in sleep mode) network elements (links and routers) and of adjusting the link weights so as to minimize the energy consumption as well as a network congestion measure. To tackle this multi-objective optimization problem with priority (first minimize the energy consumption and then the congestion), we propose a Mixed Integer Linear Programming based algorithm for Energy-aware Weights Optimization (MILP-EWO). Our heuristic exploits the Interior Gateway Protocol Weight Optimization (IGP-WO) algorithm for optimizing the OSPF link weights so as to minimize the network congestion. The computational results obtained for seven real network topologies and different types of traffic matrices show that it is possible to switch off a substantial number of nodes and links during low and moderate traffic periods, while guaranteeing that network congestion is low enough to ensure service quality. For comparison purposes, we also report the results obtained with (randomized) greedy procedures. The proposed approach is also validated on two networks of emulated Linux routers.
منابع مشابه
Energy-aware traffic engineering: A routing-based distributed solution for connection-oriented IP networks
The present paper deals with energy saving in IP networks and proposes a distributed energy-aware traffic engineering solution, named DAISIES, for switching off network links according to traffic variations. DAISIES works in a connectionoriented network, e.g. an IP/MPLS network, and follows a routing-based approach, i.e. it acts on the routing algorithm whilst link switch-off/on are consequence...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملA MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing
Internet energy consumption is rapidly becoming an issue due to the exponential traffic growth and the rapid expansion of communication infrastructures worldwide. We address the problem of energy-aware intra-domain traffic engineering in networks operated with a shortest path routing protocol. We consider the problem of switching off (putting in sleeping mode) network elements (links and router...
متن کاملMASTER THESIS Energy Efficiency in IP over WDM Networks
In the last decade, energy efficiency in backbone networks has become an important problem due to the significant growth in the Internet traffic. A very promising solution to solve this problem in Internet Protocol (IP) over Wavelength Division Multiplexing (WDM) networks is the Virtual Topology Adaptation approach, which permits adapting network resources by following a dynamic daily traffic p...
متن کاملShortest Path Routing Modelling, Infeasibility and Polyhedra
The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. This is of utmost importance. Traffic in IP networks is commonly routed along shortest paths with respect to auxiliary link weights, e.g. using the OSPF or IS-IS protocol. Here, shortest path r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Networks
دوره 57 شماره
صفحات -
تاریخ انتشار 2013